Truth in Semantics
نویسنده
چکیده
Semantic theories for natural languages purport to describe a central aspect of the meaning of natural language sentences. In doing so, they usually employ some notion of truth. Most semanticists, even those who have no objections to invoking propositions, will define a truth-predicate that applies to sentences. Some will also employ a notion of propositional truth. Both types of semanticist face the question whether and how the semantic notion(s) of truth they are employing is (are) related to the ordinary, pre-theoretic notion(s) of truth. It seems immediately problematic to say that the semantic truth notion is a pre-theoretic notion. For pretheoretically, we do not seem to apply “true” to sentences. So, if the semantic truth notion is in any interesting way related to a pre-theoretic notion of truth, then the relationship is more complex.As I shall explain in Section 2, however, there are some straightforward ways of postulating an analytic link between semantic truth notions and ordinary truth. Now, recently there have been a host of proposals to adopt a “relativistic” semantics of certain expressions, such as predicates of personal taste, epistemic modals, sentences about the contingent future, evaluative sentences generally, sentences attributing knowledge etc. All these proposals involve the claim that the truth of utterances or propositions depends on an extra factor. As we shall see, the answers standard semanticists can provide to the question of the status of their semantic truth-predicate do not transfer easily to these new, relativistic theories. In Section 3, I shall make some proposals as to how relativists can deal with these
منابع مشابه
A generalization of the Chen-Wu duality into quantale-valued setting
With the unit interval [0,1] as the truth value table, Chen and Wupresented the concept of possibility computation over dcpos.Indeed, every possibility computation can be considered as a[0,1]-valued Scott open set on a dcpo. The aim of this paper is tostudy Chen-Wu's duality on quantale-valued setting. For clarity,with a commutative unital quantale $L$ as the truth value table, weintroduce a c...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملWhat is a Non-truth-functional Logic?
What is the fundamental insight behind truth-functionality? When is a logic interpretable by way of a truth-functional semantics? To address such questions in a satisfactory way, a formal definition of truthfunctionality from the point of view of abstract logics is clearly called for. As a matter of fact, such a definition has been available at least since the 70s, though to this day it still r...
متن کاملInformation, Negation, and Paraconsistency
This paper begins by arguing that a truth conditional approach to the semantics for relevant logic is unnatural. Rather, we should adopt an informational semantics. On this view, the indices in the RoutleyMeyer semantics are situations, which can be said either to contain or not contain, particular pieces of information. Valid inference, then, is seen as information preservation, not truth pres...
متن کاملThe Semantics of the Word Istikbar (Arrogance) in the Holy Quran based on Syntagmatic Relations(A Case Study of Semantic Proximity and Semantic Contrast)
The word istikbar (arrogance) is one of the key words in the monotheistic system of the Quran, which has found a special status as a special feature of the opponents and adversaries of the call to the truth. Given the prominent role of this issue in the human life system and its provision of corruption and moral deviations, it is necessary to represent the nature of the elements that make up th...
متن کاملAny-world assumptions in logic programming
Due to the usual incompleteness of information representation, any approach to assign a semantics to logic programs has to rely on a default assumption on the missing information. The stable model semantics, that has become the dominating approach to give semantics to logic programs, relies on the Closed World Assumption (CWA), which asserts that by default the truth of an atom is false. There ...
متن کامل